Reduced Complexity Calculation of LMMSE Filter Coefficients for GFDM

A low-complexity algorithm for calculation of the LMMSE filter coefficients for GFDM in a block-fading multipath environment is derived in this letter. The simplification is based on the block circularity of the involved matrices. The proposal reduces complexity from cubic to squared order. The proposed approach can be generalized to other waveforms with circular pulse shaping.Comment: Submitted to IEEE Electronics Letter

Waveform Advancements and Synchronization Techniques for Generalized Frequency Division Multiplexing

To enable a new level of connectivity among machines as well as between people and machines, future wireless applications will demand higher requirements on data rates, response time, and reliability from the communication system. This will lead to a different system design, comprising a wide range of deployment scenarios. One important aspect is the evolution of physical layer (PHY), specifically the waveform modulation. The novel generalized frequency division multiplexing (GFDM) technique is a prominent proposal for a flexible block filtered multicarrier modulation. This thesis introduces an advanced GFDM concept that enables the emulation of other prominent waveform candidates in scenarios where they perform best. Hence, a unique modulation framework is presented that is capable of addressing a wide range of scenarios and to upgrade the PHY for 5G networks. In particular, for a subset of system parameters of the modulation framework, the problem of symbol time offset (STO) and carrier frequency offset (CFO) estimation is investigated and synchronization approaches, which can operate in burst and continuous transmissions, are designed. The first part of this work presents the modulation principles of prominent 5G candidate waveforms and then focuses on the GFDM basic and advanced attributes. The GFDM concept is extended towards the use of OQAM, introducing the novel frequency-shift OQAM-GFDM, and a new low complexity model based on signal processing carried out in the time domain. A new prototype filter proposal highlights the benefits obtained in terms of a reduced out-of-band (OOB) radiation and more attractive hardware implementation cost. With proper parameterization of the advanced GFDM, the achieved gains are applicable to other filtered OFDM waveforms. In the second part, a search approach for estimating STO and CFO in GFDM is evaluated. A self-interference metric is proposed to quantify the effective SNR penalty caused by the residual time and frequency misalignment or intrinsic inter-symbol interference (ISI) and inter-carrier interference (ICI) for arbitrary pulse shape design in GFDM. In particular, the ICI can be used as a non-data aided approach for frequency estimation. Then, GFDM training sequences, defined either as an isolated preamble or embedded as a midamble or pseudo-circular pre/post-amble, are designed. Simulations show better OOB emission and good estimation results, either comparable or superior, to state-of-the-art OFDM system in wireless channels

Competitive coevolutionary algorithm for robust multi-objective optimization: the worst case minimization

Multi-Objective Optimization (MOO) problems might be subject to many modeling or manufacturing uncertainties that affect the performance of the solutions obtained by a multi-objective optimizer. The decision maker must perform an extra step of sensitivity analysis in which each solution should be verified for its robustness, but this post optimization procedure makes the optimization process expensive and inefficient. In order to avoid this situation, many researchers are developing Robust MOO, where uncertainties are incorporated in the optimization process, which seeks optimal robust solutions. We introduce a coevolutionary approach for robust MOO, without incorporating robustness measures neither in the objective function nor in the constraints. Two populations compete in the environment, one representing solutions and minimizing the objectives, another representing uncertainties and maximizing the objectives in a worst case scenario. The proposed coevolutionary method is a coevolutionary version of MOEA/D. The results clearly suggest that these competing co-evolving populations are able to identify robust solutions to multi-objective optimization problems.info:eu-repo/semantics/publishedVersio

Scalable and customizable benchmark problems for many-objective optimization

Solving many-objective problems (MaOPs) is still a significant challenge in the multi-objective optimization (MOO) field. One way to measure algorithm performance is through the use of benchmark functions (also called test functions or test suites), which are artificial problems with a well-defined mathematical formulation, known solutions and a variety of features and difficulties. In this paper we propose a parameterized generator of scalable and customizable benchmark problems for MaOPs. It is able to generate problems that reproduce features present in other benchmarks and also problems with some new features. We propose here the concept of generative benchmarking, in which one can generate an infinite number of MOO problems, by varying parameters that control specific features that the problem should have: scalability in the number of variables and objectives, bias, deceptiveness, multimodality, robust and non-robust solutions, shape of the Pareto front, and constraints. The proposed Generalized Position-Distance (GPD) tunable benchmark generator uses the position-distance paradigm, a basic approach to building test functions, used in other benchmarks such as Deb, Thiele, Laumanns and Zitzler (DTLZ), Walking Fish Group (WFG) and others. It includes scalable problems in any number of variables and objectives and it presents Pareto fronts with different characteristics. The resulting functions are easy to understand and visualize, easy to implement, fast to compute and their Pareto optimal solutions are known.This work has been supported by the Brazilian agencies (i) National Council for Scientific and Technological Development (CNPq); (ii) Coordination for the Improvement of Higher Education (CAPES) and (iii) Foundation for Research of the State of Minas Gerais (FAPEMIG, in Portuguese)

Information to the eye of the beholder: data visualization for many-objective optimization

The visualization gap is one of the important challenges posed by many-objective optimization problems (MaOPs). In this paper, we present an integrated data visualization method for MaOPs, called CAP-vis plot, combining the Chord diagram, the Angular mapping and the Parallel coordinates in the same visualization. The method follows the circular design layout, showing different levels of information. This new approach allows the spatial location of points in high dimensional spaces, the visualization of harmony and conflict between objectives, as well as the comparison of the approximation sets provided by different algorithms. With this work, we try to fill the visualization gap and bring information to the eye of the decision-maker and the optimizer, with an intuitive overview of the obtained results. Some experiments were performed using the Benchmark Functions proposed for the IEEE-CEC 2018 Competition on Many-Objective Optimization. We used the tool to visualize the results obtained by NSGA-III, HypE, RVEA, MOEA/DD, PICEA-g, using the PlatEMO MATLAB platform, with the same parameter settings of the competition. The results on the Benchmark Problems show the importance of the qualitative analysis of the data. The experiments show how visualization can help interpretation of the results and identification of strengths and drawbacks of MOEA.The authors would like to thank the Brazilian agencies CAPES, CNPq and FAPEMIG for the financial support

Incorporation of region of interest in a decomposition-based multi-objective evolutionary algorithm

Preference-based Multi-Objective Evolutionary Algorithm (MOEA) restrict the search to a given region of the Pareto front preferred by the Decision Maker (DM), called the Region of Interest (ROI). In this paper, a new preference-guided MOEA is proposed. In this method, we define the ROI as a preference cone in the objective space. The preferential direction and the aperture of the cone are parameters that the DM has to provide to define the ROI. Given the preference cone, we employ a weight vector generation method that is based on a steady-state evolutionary algorithm. The main idea of our method is to evolve a population of weight vectors towards the characteristics that are desirable for a set of weight vectors in a decomposition-based MOEA framework. The main advantage is that the DM can define the number of weight vectors and thus can control the population size. Once the ROI is defined and the set of weight vectors are generated within the preference cone, we start a decomposition-based MOEA using the provided set of weights in its initialization. Therefore, this enforces the algorithm to converge to the ROI. The results show the benefit and adequacy of the preference cone MOEA/D for preference-guided many-objective optimization.This work was supported by the Brazilian funding agencies CAPES and CNPq